Multistage Games with Communication

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multistage Games with Communication

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

Revelation Principles in Multistage Games∗

We study the revelation principle in multistage games for perfect Bayesian equilibium and sequential equilibrium. The question of whether or not the revelation principle holds is subtle, as expanding players’ opportunities for communication expands the set of consistent beliefs at off-path information sets. In settings with adverse selection but no moral hazard, Nash, perfect Bayesian, and sequ...

متن کامل

Multistage Communication with and without Verifiable Types

We survey the main results on strategic information transmission, which is often referred to as ”persuasion” when types are verifiable and as ”cheap talk” when they are not. In the simplest model, an informed player sends a single message to a receiver who makes a decision. The players’utilities depend on the sender’s information and the receiver’s decision, but not on the sender’s message. Fur...

متن کامل

Games with Limited Communication Structure

In this paper we consider cooperative transferable utility games with limited communication structure, called graph games. Agents are able to cooperate with each other only if they can communicate directly or indirectly with each other. For the class of acyclic graph games recently the average tree solution has been proposed. It was proven that the average tree solution is a core element if the...

متن کامل

Basic Network Creation Games with Communication Interests

Network creation games model the creation and usage costs of networks formed by a set of selfish peers. Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links. In doing so, a peer can reduce its individual communication cost. Typically, these costs are modeled by the maximum or average distance in the network. We introduce a generalized ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Econometrica

سال: 1986

ISSN: 0012-9682

DOI: 10.2307/1913154